Communication Complexity for Distributed Scheduling in Wireless Ad hoc Networks
نویسندگان
چکیده
In wireless communication networks, it is important to schedule transmissions according to the priority weights of different data packets. Quite often, the scheduling is carried out in a distributed way and information exchange via wireless channels is necessary. The communication overhead of the distributed scheduling is studied, in terms of the number of communication bits needed for accomplishing the scheduling. The theory of communication complexity is applied to derive corresponding lower bounds in the special case of complete connection graph. Practical broadcast protocols are proposed to accomplish the distributed scheduling. Numerical results are provided to demonstrate the theoretical analysis.
منابع مشابه
Assessment of DSACC and QPART Algorithms in Ad Hoc Networks
The rapid advancement in wireless over wired has augmented the need for improving theQuality of Service (QoS) over such wireless links. However, the wireless ad hoc networkshave too low bandwidth, and establishing a QoS in these networks is a difficult issue. So,support of quality of service in ad hoc networks is the topical issue among the networkscience researchers. In this research we are go...
متن کاملطراحی لایه- متقاطع برای کنترل ازدحام، مسیریابی و زمانبندی در شبکههای بیسیم ad-hocبا در نظرگرفتن توان الکتریکی گرهها
Abstract Ad hoc Wireless Networks, are networks formed by a collection of nodes through radio. In wireless networking environment, formidable challenges are presented. One important challenge is connection maintenance mechanism for power consumption. In this paper, a multi-objective optimal design is considered for ad-hoc networks which address the electrical power of nodes effects on cross-l...
متن کاملVehicular Networks: A Survey on Architecture, Communication Technologies and Applications
The Intelligent Transportation System (ITS) provides wireless and mobile communication between vehicles and infrastructure to improve the safety of transportation and make the journey more enjoyable. This system consists of many fixed and mobile nodes (Vehicles, Trains, Vessels, Air planes), Wireless and Wired Telecommunication Technologies to exchange information between mobile nodes or betwee...
متن کاملImproving Quality of Service Routing in Mobile Ad Hoc Networks Using OLSR
Mobile ad hoc networks (MANET) are constructed by mobile nodes without access point. Since MANET has certain constraints, including power shortages, an unstable wireless environment and node mobility, more power-efficient and reliable routing protocols are needed. The OLSR protocol is an optimization of the classical link state algorithm. OLSR introduces an interesting concept, the multipoint r...
متن کاملSession TP2: Joint Routing and Scheduling Metrics for Ad Hoc Wireless Networks
In this paper we address the problems of routing and scheduling in resource-limited ad hoc wireless networks supporting connectionless traffic. Motivated by the novel challenges and trade-offs introduced by ad hoc wireless networks, we propose link metric-based distributed routing and scheduling algorithms. We consider limited transceiver, energy and unlimited bandwidth conditions and our perfo...
متن کامل